Applications of Quantified Constraint Solving over the Reals - Bibliography

نویسنده

  • Stefan Ratschan
چکیده

Quantified constraints over the reals appear in numerous contexts. Usually existential quantification occurs when some parameter can be chosen by the user of a system, and univeral quantification when the exact value of a parameter is either unknown, or when it occurs in infinitely many, similar versions. The following is a list of application areas and publications that contain applications for solving quantified constraints over the reals. The list is certainly not complete, but grows as the author encounters new items. Contributions are very welcome!

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applications of Real First-Order Constraint Solving Bibliography

First-order constraints over the reals appear in numerous contexts. Usually existential quantification occurs when some parameter can be chosen by the user of a system, and univeral quantification when the exact value of a parameter is either unknown, or when it occurs in infinitely many, similar versions. The following is a list of application areas and publications that contain applications f...

متن کامل

Quantified Set Inversion Algorithm with Applications to Control

In this paper, a new algorithm based on Set Inversion techniques and Modal Interval Analysis is presented. This algorithm allows solving problems involving quantified constraints over the reals through the characterization of their solution sets. The presented methodology can be applied over a wide range of problems involving uncertain (non)linear systems. Finally, an advanced application is so...

متن کامل

Continuous First-Order Constraint Satisfaction

This paper shows how to use constraint programming techniques for solving first-order constraints over the reals (i.e., formulas in the first-order predicate language over the structure of the real numbers). More specifically, based on a narrowing operator that implements an arbitrary notion of consistency for atomic constraints over the reals (e.g., box-consistency), the paper provides a narro...

متن کامل

A Note on Mixed Set Programming

This short paper presents the “Mixed Set Programming” framework of NCL in modeling and solving constraint satisfaction problems over a mixed domain of reals, integers, Booleans, references, and sets. Modeling abstraction and the solving of a few hard combinatorial problems such as set partitioning and job-shop scheduling are illustrated.

متن کامل

Solving Composed First-Order Constraints from Discrete-Time Robust Control

This paper deals with a problem from discrete-time robust control which requires the solution of constraints over the reals that contain both universal and existential quantifiers. For solving this problem we formulate it as a program in a (fictitious) constraint logic programming language with explicit quantifier notation. This allows us to clarify the special structure of the problem, and to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1205.5571  شماره 

صفحات  -

تاریخ انتشار 2007